Practical and Secure Outsourcing Algorithms of Matrix Operations Based on a Novel Matrix Encryption Method
نویسندگان
چکیده
منابع مشابه
Algorithm-Based Secure and Fault Tolerant Outsourcing of Matrix Computations
We study interactive algorithmic schemes for outsourcing matrix computations on untrusted global computing infrastructures such as clouds or volunteer peer-to-peer platforms. In these schemes the client outsources part of the computation with guaranties on both the inputs’ secrecy and output’s integrity. For the sake of efficiency, thanks to interaction, the number of operations performed by th...
متن کاملEfficient Secure Matrix Multiplication over Lwe-based Homomorphic Encryption
Homomorphic encryption enables various calculations while preserving the data confidentiality. In this paper, we apply the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure matrix multiplication between two matrices. To reduce both the ciphertext size and the computation cost, we propose a new method to pack a matrix into a single ciphertext...
متن کاملSecure and {\sl Practical} Identity-Based Encryption
In this paper, we present a variant of Waters’ Identity-Based Encryption scheme with a much smaller public-key size (only a few kilobytes). We show that this variant is semantically secure against passive adversaries in the standard model. In essence, the new scheme divides Waters’ public key size by a factor l at the cost of (negligibly) reducing security by l bits. Therefore, our construction...
متن کاملEfficient Secure and Verifiable Outsourcing of Matrix Multiplications
With the emergence of cloud computing services, a resourceconstrained client can outsource its computationally-heavy tasks to cloud providers. Because such service providers might not be fully trusted by the client, the need to verify integrity of the returned computation result arises. The ability to do so is called verifiable delegation or verifiable outsourcing. Furthermore, the data used in...
متن کاملSecure and practical identity-based encryption
In this paper, we present a variant of Waters’ Identity-Based Encryption scheme with a much smaller public-key size (only a few kilobytes). We show that this variant is semantically secure against passive adversaries in the standard model. In essence, the new scheme divides Waters’ public key size by a factor ` at the cost of (negligibly) reducing security by ` bits. Therefore, our construction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2913591